Bidding Languages
ثبت نشده
چکیده
In a combinatorial auction environment with m goods, a bid that ascribes a real value to any bundle of goods G, b : 2G → R, can require an exponential amount of space to represent, as there are 2m possible bundles. In these notes, we describe several bidding languages that can represent some bids more compactly. While they are called bidding languages, and can be thought of as languages bidders can use to submit bids to an auctioneer, bidding languages can likewise describe valuations, v : 2G → R. The languages we present are general enough to describe any monotone, normalized bid (or valuation).
منابع مشابه
Bidding Languages for Combinatorial Auctions
Combinatorial auctions provide a valuable mechanism for the allocation of goods in settings where buyer valuations exhibit complex structure with respect to substitutabilityand complementarity. Most algorithms are designed to work with explicit bids for concrete bundles of goods. However, logical bidding languages allow the expression of complex utility functions in a natural and concise way. W...
متن کاملWinner determination in combinatorial auctions with logic-based bidding languages
We propose the use of logic-based preference representation languages based on weighted propositional formulas for specifying bids in a combinatorial auction. We then develop several heuristics for a branch-and-bound search algorithm for determining the winning bids in this framework and report on their empirical performance. The logic-based approach is attractive due to its high degree of flex...
متن کاملBIDFLOW: a New Graph-Based Bidding Language for Combinatorial Auctions
In this paper we introduce a new graph based bidding language for combinatorial auctions. In our language, each bidder submits to the arbitrator a generalized flow network (netbid) representing her bids. The interpretation of the winner determination problem as an aggregation of individual preferences represented as flowbids allows building an aggregate netbid for its representation. Labelling ...
متن کاملTheoretical Foundations of Iterative Combinatorial Auctions with Side Constraints: Computational Properties of Generic Pricing Rules
Combinatorial auctions are nowadays used in a variety of application domains such as transportation or industrial procurement using a variety of bidding languages and different side constraints. This flexibility in the bidding languages and the side constraints is essential in these domains, but has not been considered in the theoretical literature so far. In this paper, we analyze different pr...
متن کاملAdwords Auctions with Decreasing Valuation Bids
The choice of a bidding language is crucial in auction design in order to correctly capture bidder utilities. We propose a new bidding model for the Adwords auctions of search engine advertisement – decreasing valuation bids. This provides a richer language than the current model for advertisers to convey their preferences. Besides providing more expressivity, our bidding model has two addition...
متن کامل